Implementation of the Optimal Normal Basis Operations in Elliptic Curve Cryptography in VIVA
نویسنده
چکیده
The aim of this project is to implement the operations of Elliptic Curve Cryptography built over GF(2) represented with optimal normal basis in VIVA System. These operations include multiplication, inverse, point addition, point doubling and scalar multiplication. The target device is Xilinx 4062 embedded in the FAI board of HAL-15 hypercomputer. The synthesis results using VIVA and VHDL are compared at the end of this report and a conclusion is drawn from comparison.
منابع مشابه
Exploration of Design Space in ECDSA
The paper describes FPGA implementation of cryptographic coprocessor performing operations on elliptic curve points with coordinates in GF (2). Polynomial basis and normal basis arithmetic units are presented and compared. Hardware implementation of GCD inversion in polynomial basis is described. Where an optimal normal basis exists, the normal basis arithmetic performs better. The digit width ...
متن کاملFPGA Implementation of a Microcoded Elliptic Curve Cryptographic Processor
Elliptic curve cryptography (ECC) has been the focus of much recent attention since it ooers the highest security per bit of any known public key cryptosystem. This beneet of smaller key sizes makes ECC particularly attractive for embedded applications since its implementation requires less memory and processing power. In this paper a microcoded Xilinx Virtex based elliptic curve processor is d...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005